Simulated Annealing Model for Reticulate Evolution in Molecular Sequences
نویسندگان
چکیده
The molecular sequence in the nature are evolved rather than invented. They are adopted from preexisting sequences. The conventional assumption on of independent evolution has been challenged by the biological evidence of hybridization, horizontal gene transfer and recombination. In such a scenario classical approaches of representing evolution by phylogenetic tree construction method fails to represent evolution. To represent such an evolution we need network models called reticulate networks. Inference of such a network given some optimization criterion like maximum likelihood or maximum parsimony have been proved to be NP-complete, so we need a model which can provide a feasible low cost solution. In this paper we propose a model based on simulated annealing which provides a global optimum solution. This method is evaluated with other available method which gives promising results.
منابع مشابه
A program for calculating and displaying compatibility matrices as an aid in determining reticulate evolution in molecular sequences
Reticulate evolution in molecular sequences is caused by recombination or gene conversion, and may interfere with the reconstruction of evolutionary history. This paper presents a program which calculates compatibility matrices for detecting reticulate evolution. In addition to visual inspection of matrices, they can be analysed statistically for clustering. The method is demonstrated using hum...
متن کاملQuartet-net: a quartet-based method to reconstruct phylogenetic networks.
Phylogenetic networks can model reticulate evolutionary events such as hybridization, recombination, and horizontal gene transfer. However, reconstructing such networks is not trivial. Popular character-based methods are computationally inefficient, whereas distance-based methods cannot guarantee reconstruction accuracy because pairwise genetic distances only reflect partial information about a...
متن کاملReconstruction of Reticulate Networks from Gene Trees
One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along the way. However, empirical analyses of different genes indicate that the evolution of genomes is often more complex than can be represented by such a model. Thus, the following problem is of significant interest in molecular ev...
متن کاملGenetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy
This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...
متن کاملComparison of Simulated Annealing and Electromagnetic Algorithms for Solution of Extended Portfolio Model
This paper presents two meta-heuristic algorithms to solve an extended portfolio selection model. The extended model is based on the Markowitz's Model, aiming to minimize investment risk in a specified level of return. In order to get the Markowitz model close to the real conditions, different constraints were embedded on the model which resulted in a discrete and non-convex solution space. ...
متن کامل